Application of efficient composite methods for computing with certainty periodic orbits in molecular systems

نویسنده

  • A. E. Perdiou
چکیده

Recently, we have proposed a technique for the computation of periodic orbits in molecular systems, based on the characteristic bisection method [Vrahatis et al., Comput. Phys. Commun. 138 (2001) 53]. The main advantage of the characteristic bisection method is that it converges with certainty within a given starting rectangular region. In this paper we further improve this technique by applying, on a surface of section of a Poincaré map, an iterative scheme based on the composition of the characteristic bisection method with other more rapid root-finding methods such as Newton’s or Broyden’s methods. Thus, the composite schemes compute rapidly with certainty periodic orbits of molecular systems. By applying these methods to the LiNC/LiCN molecular system we obtain promising results. We have reproduced previous results using considerable less CPU time. Also, we have located and computed new asymmetric families of periodic orbits.  2002 Elsevier Science B.V. All rights reserved. PACS: 39.30; 31.15.-p; 02.70.-c; 05.45.+b

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing with Certainty Individual Members of Families of Periodic Orbits of a given Period

The accurate computation of families of periodic orbits is very important in the analysis of various celestial mechanics systems. The main difficulty for the computation of a family of periodic orbits of a given period is the determination within a given region of an individual member of this family which corresponds to a periodic orbit. To compute with certainty accurate individual members of ...

متن کامل

A Method for Computing Families of Periodic Orbits Based on Unconstrained Optimization

A new efficient method is presented for the numerical computation of families of periodic orbits of systems with three or more degrees of freedom. This method is based on a well-known procedure using the variational equations as well as on unconstrained optimization techniques. This combination accelerates the convergence of previous schemes. The new composite method has been implemented here o...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

Asymptotic algorithm for computing the sample variance of interval data

The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001